Multidimensional global extremum seeking via the DIRECT optimisation algorithm

نویسندگان

  • Sei Zhen Khong
  • Dragan Nesic
  • Chris Manzie
  • Ying Tan
چکیده

DIRECT is a sample-based global optimisation method for Lipschitz continuous functions defined over compact multidimensional domains. This paper adapts the DIRECT method with a modified termination criterion for global extremum seeking control of multivariable dynamical plants. Finite-time semi-global practical convergence is established based on a periodic sampled-data control law, whose sampling period is a parameter which determines the region and accuracy of convergence. A crucial part of the development is dedicated to a robustness analysis of the DIRECT method against bounded additive perturbations on the objective function. Extremum seeking involving multiple units is also considered within the same context as a means to increase the speed of convergence. Numerical examples of global extremum seeking based on DIRECT are presented at the end. © 2013 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unified frameworks for sampled-data extremum seeking control: Global optimisation and multi-unit systems

Two frameworks are proposed for extremum seeking of general nonlinear plants based on a sampled-data control law, within which a broad class of nonlinear programmingmethods is accommodated. It is established that under some generic assumptions, semi-global practical convergence to a global extremum can be achieved. In the case where the extremum seeking algorithm satisfies a stronger asymptotic...

متن کامل

Multi-agent source seeking via discrete-time extremum seeking control

Recent developments in extremum seeking theory have established a general framework for the methodology, although the specific implementations, particularly in the context of multi-agent systems, have not been demonstrated. In this work, a group of sensor-enabled vehicles is used in the context of the extremum seeking problem using both local and global optimisation algorithms to locate the ext...

متن کامل

Iterative learning control based on extremum seeking

This paper proposes a non-model based approach to iterative learning control (ILC) via extremumseeking. Single-input–single-output discrete-time nonlinear systems are considered, where the objective is to recursively construct an input such that the corresponding system output tracks a prescribed reference trajectory as closely as possible on finite horizon. The problem is formulated in terms o...

متن کامل

An Improved Extremum Seeking Algorithm Based on the Chaotic Annealing Recurrent Neural Network and Its Application

Extremum seeking problem deals with the problem of minimizing or maximizing a plant over a set of decision variables[1]. Extremum seeking problems represent a class of widespread optimization problems arising in diverse design and planning contexts. Many large-scale and real-time applications, such as traffic routing and bioreactor systems, require solving large-scale extremum seeking problem i...

متن کامل

Extremum Seeking Control via Sliding Mode with Two Surfaces

In this paper, we present a new approach of extremum seeking control scheme, which applies two surfaces. Compared to other extremum seeking control algorithms, the new approach produces nearly no oscillation in the control results because the searching signal in this approach is no longer a periodic one. The control accuracy can be guaranteed by choosing two surfaces at a suitable distance. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Automatica

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2013